Interconnection Networks via Adjacencies and Their Vertex-Degree Based Graph Invariants

Interconnection Networks are a boon to human made large computing systems which often designed based on the need. In this paper, we address question of obtaining an interconnection network suit specific need is cumbersome procedure. The methods for constructing infinitely networks from any simple, undirected graph \(G\) illustrated and their properties discussed. Further, study behaviour certain vertex-degree invariants constructed under transformations by means operation obtain explicit relations energy some degree-based topological indices. Also, show that they can be computed in polynomial time these networks. By doing so, also new infinite families integral graphs.